public class demo29 {
    //
    /*class Solution {
        public boolean isAnagram(String s, String t) {
            if(s.length()!=t.length()) return false;
            int[] word = new int[26];
            int len = s.length();
            char[] c1 = s.toCharArray();
            char[] c2 = t.toCharArray();
            for(int i = 0;i<len;i++)
            {
                word[c1[i]-'a']++;
                word[c2[i]-'a']--;
            }
            for(int val : word)
            {
                if(val!=0)
                    return false;
            }
            return true;
        }
    }*/
}
